Dimensionally Consistent Preconditioning for Saddle-Point Problems
نویسندگان
چکیده
Abstract The preconditioned iterative solution of large-scale saddle-point systems is great importance in numerous application areas, many them involving partial differential equations. Robustness with respect to certain problem parameters often a concern, and it can be addressed by identifying proper scalings preconditioner building blocks. In this paper, we consider new perspective finding effective robust preconditioners. Our approach based on the consideration natural physical units underlying respective problem. This point view, which refer as dimensional consistency, suggests combination intrinsic It turns out that scaling obtained way leads robustness relevant cases. As consequence, advertise consistency preconditioning systematic designing parameter preconditoners for arising from models phenomena.
منابع مشابه
Some Preconditioning Techniques for Saddle Point Problems
Saddle point problems arise frequently in many applications in science and engineering, including constrained optimization, mixed finite element formulations of partial differential equations, circuit analysis, and so forth. Indeed the formulation of most problems with constraints gives rise to saddle point systems. This paper provides a concise overview of iterative approaches for the solution...
متن کاملGeneral constraint preconditioning iteration method for singular saddle-point problems
For the singular saddle-point problems with nonsymmetric positive definite (1, 1) block, we present a general constraint preconditioning (GCP) iteration method based on a singular constraint preconditioner. Using the properties of the Moore-Penrose inverse, the convergence properties of the GCP iteration method are studied. In particular, for each of the two different choices of the (1, 1) bloc...
متن کاملPreconditioning Mixed Finite Element Saddle-point Elliptic Problems
We consider saddle-point problems that typically arise from the mixed finite element discretization of second order elliptic problems. By proper equivalent algebraic operations the considered saddle-point problem is transformed to another saddle-point problem. The resulting problem can then be efficiently preconditioned by a block-diagonal matrix or by a factored block-matrix (the blocks corres...
متن کاملPreconditioners for Generalized Saddle-point Problems Preconditioners for Generalized Saddle-point Problems *
We examine block-diagonal preconditioners and efficient variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. We consider the general, nonsymmetric, nonsingular case. In particular, the (1,2) block need not equal the transposed (2,1) block. Our preconditioners arise from computationally efficient splittings of the (1,1) block. We provide analyses for the...
متن کاملCombination preconditioning of saddle point systems for positive definiteness
Amongst recent contributions to preconditioning methods for saddle point systems, standard iterative methods in nonstandard inner products have been usefully employed. Krzyżanowski (Numer. Linear Algebra Appl. 2011; 18:123–140) identified a two-parameter family of preconditioners in this context and Stoll and Wathen (SIAM J. Matrix Anal. Appl. 2008; 30:582–608) introduced combination preconditi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational methods in applied mathematics
سال: 2021
ISSN: ['1609-4840', '1609-9389']
DOI: https://doi.org/10.1515/cmam-2020-0037